Smoothed analysis for the condition number of structured real polynomial systems
نویسندگان
چکیده
We consider the sensitivity of real zeros structured polynomial systems to pertubations their coefficients. In particular, we provide explicit estimates for condition numbers random and extend these smoothed analysis setting.
منابع مشابه
Uniform Smoothed Analysis of a Condition Number for Linear Programming
Bürgisser, Cucker, and Lotz [arxiv:math.NA/0610270] proved a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Applications to linear and polynomial equation solving were given. We show that a suitable modification of the general theorem in that paper, adapted to a spherical convex setting, allows to analyze condition numbers of...
متن کاملSmoothed Analysis of Renegar's Condition Number for Linear Programming
For any linear program, we show that a slight random relative perturbation of that linear program has small condition number with high probability. Following [ST01], we call this smoothed analysis of the condition number. Part of our main result is that the expectation of the log of the condition number of any appropriately scaled linear program subject to a Gaussian perturbation of variance σ ...
متن کاملRobust smoothed analysis of a condition number for linear programming
We perform a smoothed analysis of the GCC-condition number C (A) of the linear programming feasibility problem ∃x ∈ R Ax < 0. Suppose that Ā is any matrix with rows ai of euclidean norm 1 and, independently for all i, let ai be a random perturbation of ai following the uniform distribution in the spherical disk in S of angular radius arcsinσ and centered at ai. We prove that E(ln C (A)) = O(mn/...
متن کاملWorst Possible Condition Number of Polynomial Systems
A worst case bound for the condition number of a generic system of polynomial equations with integer coefficients is given. For fixed degree and number of equations, the condition number is (non-uniformly, generically) pseudo-polynomial in the input size.
متن کاملSmoothed Analysis of Interior-Point Algorithms: Condition Number
A linear program is typically specified by a matrix A together with two vectors b and c, where A is an n-by-d matrix, b is an n-vector and c is a d-vector. There are several canonical forms for defining a linear program using (A, b, c). One commonly used canonical form is: max cx s.t. Ax ≤ b and its dual min by s.t A y = c, y ≥ 0. In [Ren95b, Ren95a, Ren94], Renegar defined the condition number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2021
ISSN: ['1088-6842', '0025-5718']
DOI: https://doi.org/10.1090/mcom/3647